منابع مشابه
Realizations and LP
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If the machinery of justifications...
متن کاملMinimal Realizations and State
State space transformations in the max-algebraic system theory for Discrete Event Systems (DES) are discussed. Some transformations between diierent realiza-tions of a given impulse response of a DES are suggested and their limitations are illustrated. It is explained why a general result seems hard to prove. R esum e: Nous discutons certaines transformations d' etat dans la th eorie des syst e...
متن کاملBialgebras and Realizations
In this paper we consider when a linear functional on a bialgebra is realized by the action of the bialgebra on a finite object. This depends on whether the action of the bialgebra on the functional is finite. We consider two specific cases: the Myhill–Nerode Theorem, which gives a condition for a language to be accepted by a finite automaton, and Fliess’ Theorem, which gives a condition for fo...
متن کاملVoting paradoxes and digraphs realizations
A family of permutations F forms a realization of a directed graph T = (V,E) if for every directed edge uv of T , u precedes v in more than half of the permutations. The quality q(F , T ) of the realization is the minimum, over all directed edges uv of T , of the ratio (|F(u, v)| − |F(v, u)|)/|F|, where |F(x, y)| is the number of permutations in F in which x precedes y. The study of this quanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2009
ISSN: 0168-0072
DOI: 10.1016/j.apal.2009.07.010